Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
441	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.inf.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
442	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
443	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
444	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
445	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
446	"Job DemandsResources Theory" in: Wellbeing: A Complete Reference Guide Add to Reading List Source URL: www.beanmanaged.com Language: English - Date: 2014-03-03 15:30:00 Human resource management Occupational safety and health Stress Positive psychology Job Demands-Resources model Management science Job satisfaction Job performance Workplace stress Management Social psychology Behavioural sciences
447	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
448	BIDDER REGISTRATION FORM INSTRUCTIONS: Please use your computer to complete this pdf form. Upon completion of this form, please print, sign, and send a scanned copy to . ALL REQUESTED INFORMATION I Add to Reading List Source URL: www.usmarshals.gov Language: English - Date: 2015-02-03 16:01:02 Peer-to-peer computing Auctioneering Auction Purchasing Business Auction theory Bitcoin
449	Computational Aspects of Multi-Winner Approval Voting Haris Aziz Serge Gaspers Joachim Gudmundsson Add to Reading List Source URL: www.nickmattei.net Language: English - Date: 2015-03-01 18:24:36 Social choice theory Voting system criteria Politics Voting theory Voting system Approval voting Tactical voting Condorcet criterion NP-complete Psephology Voting Single winner electoral systems
450	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics

UPDATE